data complexity

Because of the variety of the data and the complexity of space in geographic information system, there are some new prob-lems appearing in the present mining algorithms.

由于地理信息系统中数据的多样性和空间复杂性，在GIS数据空间挖掘时原有的挖掘算法会遇到一些新问题。

This algorithm can simplify the data association and has polynomial complexity.

该算法采用观测-航迹关联,具有相对简单的多项式复杂度.

Considering the complexity of the object carousel protocol, this solution innovatively modifies the data carousel protocol so that the hierarchical ( directory) structure can be transmitted by use of name descriptor and parent group descriptor.

该方案考虑到对象轮播协议的复杂性，在DVB数据轮播协议的基础上，通过名字描述符和父组描述符重建文件系统。

Due to the complexity and variety of 3G charging data, development of Collector subsystem is the key point, which is also the core subject of this thesis.

由于3G话单的复杂化和多元化，采集组件的设计开发成了关键，这也就是本文研究的主题。

Using a new way to look at a page variable data, complexity, and so on.

用一栽陈办法来看一张页面洋的可变数据 、 驳杂性等.

, The algorithm used in key module to the performance of data security is thoroughly analyzed. Considering both performance of enciphering and degree of complexity of realization, steam cipher algorithm is used.

对数据通信安全性起决定作用的加密模块所采用的加密算法进行了深入的分析，综合加密性能和实现的复杂度的考虑，采用了流密码的加密算法。

Due to the variousness and the complexity of the geological conditions and the observation environments of a pit, it is unavoidable for model errors to exist in the data processing model of pit displacement monitoring.

由于基坑地质及观测环境的多样性和复杂性，基坑位移监测数据处理的理论模型与实际模型之间存在着模型误差。

This is when the complexity of relational databases starts to rub against their potential to scale.

这时候关系数据库的复杂性就开始影响其潜在的扩展规模了.

Single data replica management strategy can not meet the complexity and diverseness in data grid.

单一策略的复本管理不能适应网格系统复杂、多变的环境.

The increasing complexity of avionic system has prompted the requirements of throughput for data exchange.

随着航空电子系统的复杂性越来越高，对系统之间数据传输量的需求也相应增加。

This deluge of data necessitates new software-based tools, and its complexity requires extra consideration.

这种数据流非常需要基于软件的新工具来对付, 并且需要特别考虑其复杂性.

The time complexity of this algorithm is equal to O ( nlogn+ n [ d/ 2]), if an auxiliary data structure called Delaunay Tree is used in it.

如果采用一种称为Delaunay树的数据结构来辅助点的定位，则算法的效率为O（nlogn+n[d/2]）。